Remote data object publishing/subscribing system having a multicast key-value protocol

ABSTRACT

Described are methods, systems and computer readable media for data object publishing/subscribing via a multicast key-value protocol.

This application claims the benefit of U.S. Provisional Application No. 62/161,813, entitled “Computer Data System” and filed on May 14, 2015, which is incorporated herein by reference in its entirety.

Embodiments relate generally to computer database systems and computer networks, and more particularly, to methods, systems and computer readable media for remote data object publishing and/or subscribing using a multicast key-value protocol.

A need may exist for remote systems utilizing data to have access to updated data. Some conventional database systems may not offer a means to provide updated data to tables (or other data objects) at a remote system in a manner that is sufficiently timely, robust, and/or ordered for certain computing system applications.

Further, a need may exist to bring data sources from outside a computer data system into the computer data system and make the data available to a query engine. For example, data may be received from an external system such as a securities trading data source, an embedded system (e.g., an Internet of Things or IoT device, etc.). There may be a desire to seamlessly integrate data from one or more of these external data sources (which may be changing in real time, e.g. the price of a security) with native data in the query engine.

Embodiments were conceived in light of the above mentioned needs, problems and/or limitations, among other things.

Some implementations can include a system comprising a data source computing device including a first nontransitory memory containing instructions for a publishing process using a key-value protocol. The system can also include a first electronic communications channel including a first communications protocol, and a second electronic communications channel including a second communications protocol. The system can further include a query computing device coupled to the data source computing device via the first electronic communications channel and the second electronic communications channel, the query computing device including a second nontransitory memory containing instructions for a subscriber process using the key-value protocol.

The instructions for a publishing process stored in the first nontransitory memory can include instructions that, when executed by the data source computing device, cause the data source computing device to perform operations. The operations can include receiving, at the data source computing device, an indication of new data available, and updating, at the data source computing device, a sequence identifier value. The operations can also include packaging, at the data source computing device, at least a portion of the new data into a publisher message including a key-value pair and the updated sequence identifier value, and broadcasting, from the data source computing device, the publisher message via the first electronic communication channel.

The instructions for a subscriber process stored in the second nontransitory memory can include instructions that, when executed by the query computing device, cause the query computing device to perform operations. The operations can include receiving, at the query computing device, a request for a group of keys from a remote query processor, and transmitting, from the query computing device via the second electronic communications channel, a request for current key-value data from the data source computing device. The operations can also include receiving a request from a remote query processor to subscribe to a group of keys, and adding, at the query computing device, the current values to a key-value map, The operations can further include receiving, at the query computing device, a key-value protocol broadcast message, and for each key in the received keys that are in the key-value map, evaluating, at the query computing device, a sequence identifier (ID) to determine most recent data and updating the value for that key in the key-value map with the most recent data. The operations can also include generating an updated object based on the received key-value data, and propagating changes based on the updated data object to any dependent objects according to an update propagation graph of data object dependencies.

The first communications protocol can include an Internet protocol (IP) multicast protocol. The second communications protocol can include transmission control protocol (TCP).

The data source computing device can further include a data source process coupled to the multicast publishing process, one or more key log files generated by the data source process, and a log tailer process configured to access the one or more key log files.

The data source computing device can further include one or more data log files, wherein the log tailer process is configured to access the one or more data log files.

The query computing device further includes one or more remote query processors, and a shared memory accessible by the multicast subscriber process and at least one of the one or more remote query processors.

Some implementations can include a method for publishing that can include receiving, at a data source computing device, an indication of new data available, and updating, at the data source computing device, a sequence identifier value. The method can also include packaging, at the data source computing device, at least a portion of the new data into a publisher message including a key-value pair and the updated sequence identifier value, and broadcasting, from the data source computing device, the publisher message via a first electronic communication channel in a first communication protocol.

The first communication protocol can include an Internet protocol (IP) multicast protocol. The data source computing device can include a data source process coupled to the publishing process, one or more key log files generated by the data source process, and a log taller process configured to access the one or more key log files. The data source computing device can further include one or more data log files, wherein the log tailer process is configured to access the one or more data log files.

Some implementations can include a method for subscription, The method can include receiving, at a query computing device, a request for a group of keys from a remote query processor, and transmitting, from the query computing device via a second electronic communications channel in a first communication protocol, a request for current key-value data to a data source computing device. The method can also include receiving a request from a remote query processor to subscribe to a group of keys, and adding, at the query computing device, the current values to a key-value map. The method can further include receiving, at the query computing device, a key-value protocol broadcast message, and for each key in the received keys that are in the key-value map, evaluating, at the query computing device, a sequence identifier (ID) to determine most recent data and updating the value for that key in the key-value map with the most recent data. The method can also include generating an updated object based on the received key-value data, and propagating changes based on the updated data object to any dependent objects according to an update propagation graph of data object dependencies.

The first communication protocol includes transmission control protocol (TCP). The query computing device can further include one or more remote query processors, and a shared memory accessible by the subscriber process and at least one of the one or more remote query processors.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram of an example remote data object publishing/subscribing system and network having a multicast key-value protocol in accordance with some implementations.

FIG. 2 is a diagram of an example remote data object publishing/subscribing system having a multicast key-value protocol in accordance with some implementations.

FIG. 3 is a diagram of an example remote data object publishing/subscribing system and network having a multicast key-value protocol in accordance with some implementations.

FIG. 4 is a flowchart of an example method for remote data object publishing using a multicast key-value protocol in accordance with some implementations.

FIG. 5 is a flowchart of an example method for remote data object subscribing using a multicast key-value protocol in accordance with some implementations.

FIG. 6 is a diagram of an example computing device configured for remote data object publishing/subscribing in accordance with some implementations.

DETAILED DESCRIPTION

Reference may be made herein to the Java programming language, Java classes, Java bytecode and the Java Virtual Machine (JVM) for purposes of illustrating example implementations. It will be appreciated that implementations can include other programming languages (e.g., groovy, Scala, R, Go, etc.), other programming language structures as an alternative to or in addition to Java classes (e.g., other language classes, objects, data structures, program units, code portions, script portions, etc.), other types of bytecode, object code and/or executable code, and/or other virtual machines or hardware implemented machines configured to execute a data system query.

FIG. 1 is a diagram of an example computer data system and network 100 showing an example data distribution configuration in accordance with some implementations. In particular, the system 100 includes an application host 102, a periodic data import host 104, a query server host 106, a long-term file server 108, and a user data import host 110. While tables are used as an example data object in the description below, it will be appreciated that the data system described herein can also process other data objects such as mathematical objects (e.g., a singular value decomposition of values in a given range of one or more rows and columns of a table), TableMap objects, etc. A TableMap object provides the ability to lookup a Table by some key. This key represents a unique value (or unique tuple of values) from the columns aggregated on in a byExternal( )statement execution, for example. A TableMap object can be the result of a byExternal( )statement executed as part of a query. It will also be appreciated that the configurations shown in FIGS. 1 and 2 are for illustration purposes and in a given implementation each data pool (or data store) may be directly attached or may be managed by a file server.

The application host 102 can include one or more application processes 112, one or more log files 114 (e.g., sequential, row-oriented log files), one or more data log tailers 116 and a multicast key-value publisher 118. The periodic data import host 104 can include a local table data server, direct or remote connection to a periodic table data store 122 (e.g., a column-oriented table data store) and a data import server 120. The query server host 106 can include a multicast key-value subscriber 126, a performance table logger 128, local table data store 130 and one or more remote query processors (132, 134) each accessing one or more respective tables (136, 138). The long-term file server 108 can include a long-term data store 140. The user data import host 110 can include a remote user table server 142 and a user table data store 144. Row-oriented log files and column-oriented table data stores are discussed herein for illustration purposes and are not intended to be limiting. It will be appreciated that log files and/or data stores may be configured in other ways. In general, any data stores discussed herein could be configured in a manner suitable for a contemplated implementation.

In operation, the input data application process 112 can be configured to receive input data from a source (e.g., a securities trading data source), apply schema-specified, generated code to format the logged data as its being prepared for output to the log file 114 and store the received data in the sequential, row-oriented log file 114 via an optional data logging process. In some implementations, the data logging process can include a daemon, or background process task, that is configured to log raw input data received from the application process 112 to the sequential, row-oriented log files on disk and/or a shared memory queue (e.g., for sending data to the multicast publisher 118). Logging raw input data to log files can additionally serve to provide a backup copy of data that can be used in the event that downstream processing of the input data is halted or interrupted or otherwise becomes unreliable.

A data log tailer 116 can be configured to access the sequential, row-oriented log file(s) 114 to retrieve input data logged by the data logging process. In some implementations, the data log taller 116 can be configured to perform strict byte reading and transmission e.g., to the data import server 120). The data import server 120 can be configured to store the input data into one or more corresponding data stores such as the periodic table data store 122 in a column-oriented configuration. The periodic table data store 122 can be used to store data that is being received within a time period (e.g., a minute, an hour, a day, etc.) and which may be later processed and stored in a data store of the long-term file server 108. For example, the periodic table data store 122 can include a plurality of data servers configured to store periodic securities trading data according to one or more characteristics of the data (e.g., a data value such as security symbol, the data source such as a given trading exchange, etc.).

The data import server 120 can be configured to receive and store data into the periodic table data store 122 in such a way as to provide a consistent data presentation to other parts of the system. Providing/ensuring consistent data in this context can include, for example, recording logged data to a disk or memory, ensuring rows presented externally are available for consistent reading (e.g., to help ensure that if the system has part of a record, the system has all of the record without any errors), and preserving the order of records from a given data source. If data is presented to clients, such as a remote query processor (132, 134), then the data may be persisted in some fashion (e.g., written to disk).

The local table data server 124 can be configured to retrieve data stored in the periodic table data store 122 and provide the retrieved data to one or more remote query processors (132, 134) via an optional proxy.

The remote user table server (RUTS) 142 can include a centralized consistent data writer, as well as a data server that provides processors with consistent access to the data that it is responsible for managing. For example, users can provide input to the system by writing table data that is then consumed by query processors.

The remote query processors (132, 134) can use data from the data import server 120, local table data server 124 and/or from the long-term file server 108 to perform queries. The remote query processors (132, 134) can also receive data from the multicast key-value subscriber 126, which receives data from the multicast key-value publisher 118 in the application host 102. The performance table logger 128 can log performance information about each remote query processor and its respective queries into a local table data store 130. Further, the remote query processors can also read data from the RUTS, from local table data written by the performance logger, or from user table data read over NTS, for example,

It will be appreciated that the configuration shown in FIG. 1 is a typical example configuration that may be somewhat idealized for illustration purposes, An actual configuration may include one or more of each server and/or host type. The hosts/servers shown in FIG. 1 (e.g., 102-110, 120, 124 and 142) may each be separate or two or more servers may be combined into one or more combined server systems. Data stores can include local/remote, shared/isolated and/or redundant. Any table data may flow through optional proxies indicated by an asterisk on certain connections to the remote query processors. Also, it will be appreciated that the term “periodic” is being used for illustration purposes and can include, but is not limited to, data that has been received within a given time period (e.g., millisecond, second, minute, hour, day, week, month, year, etc.) and which has not yet been stored to a long-term data store (e.g., 140).

FIG. 2 is a diagram of an example computer data system 200 showing an example administration/process control arrangement in accordance with some implementations. The system 200 includes a production client host 202, a controller host 204, a GUI host or workstation 206, and query server hosts 208 and 210. It will be appreciated that there may be one or more of each of 202-210 in a given implementation.

The production client host 202 can include a batch query application 212 (e.g., a query that is executed from a command line interface or the like) and a real time query data consumer process 214 (e.g., an application that connects to and listens to tables created from the execution of a separate query). The batch query application 212 and the real time query data consumer 214 can connect to a remote query dispatcher 222 and one or more remote query processors (224, 226) within the query server host 1 208.

The controller host 204 can include a persistent query controller 216 configured to connect to a remote query dispatcher 232 and one or more remote query processors 228-230. In some implementations, the persistent query controller 216 can serve as the “primary client” for persistent queries and can request remote query processors from dispatchers, and send instructions to start persistent queries. For example, a user can submit a query to the persistent query controller 216, and the persistent query controller 216 starts and runs the query every day. In another example, a securities trading strategy could be a persistent query. The persistent query controller can start the trading strategy query every morning before the market opened, for instance. It will be appreciated that 216 can work on times other than days. In some implementations, the controller may require its own clients to request that queries be started, stopped, etc. This can be done manually, or by scheduled (e.g., cron jobs). Some implementations can include “advanced scheduling” (e.g., auto-start/stop/restart, time-based repeat, etc.) within the controller.

The GUI/host workstation can include a user console 218 and a user query application 220. The user console 218 can be configured to connect to the persistent query controller 216, The user query application 220 can be configured to connect to one or more remote query dispatchers (e.g., 232) and one or more remote query processors (228, 230).

FIG. 3 is a diagram of an example remote data table publishing/subscribing system and network 300 having a multicast key-value protocol in accordance with at least one embodiment. In some implementations, the key-value pair can be derived from the input application data in a table-specific manner. For example, a table for stock prices may have a key of security ID (or symbol). The value can be a data structure that is associated with that key, and can update as time passes. Each key-value can represent an “instance” in the multicast protocol and is at a specified location the shared memory array. Each of these key-value pairs can map to a row in a database table (though it would be possible for one key-value to map to multiple rows, or potentially a single row derived from multiple key-value pairs).

In particular, a data source machine 302 (e.g., computing device) can include a data source process 304 coupled to a multicast publishing process 306, key log files 308 and optional data log files 310 and providing data to each of those processes. The key log files and optional data log files can be supplied to a log tailer process 312. In some implementations, the key log files provide a method of publishing key data “out of band” in table form, for automatic subscription support built into the query language. The data log files can be for a complete log of the data, independent from the version published over the multicast data distribution system.

in some example implementations, the multicast publishing process 306 can provide two modes of communication with subscribing systems: 1) Internet protocol (IP) multicast 316 and 2) a host-to-host communication channel 314 (e.g., transmission control protocol (TCP)) for retransmit requests. While TCP/IP is discussed herein as an example networking protocol, it will be appreciated that any suitable protocol could be used, e.g., Infiniband, RDMA, etc., either over unicast or multicast. Also, The publishing or broadcasting process is described in detail below in connection with FIG. 4. The data source machine 302 via the multicast publishing process 306 can perform the steps shown in FIG. 4 and described below.

One or more query machines 318 (e.g., computing devices) can be coupled to the data source machine 302 via a wired and/or wireless network (e.g., LAN, WAN, WiFi, the Internet, or the like). The network can include the IP multicast 316 and TCP channel 314. Each query machine 318 can include a multicast subscriber process 320 coupled to shared memory 322 and one or more work processes (e.g., 324 and 326). Each remote query processor (324 and 326) can access one or more data objects such as tables (e.g., 328 and 330, respectively).

Remote query processors (e.g., 324 and 326) can be started by a remote query dispatcher process (e.g., 222 and 232) to perform a function involving the data table(s) associated with that remote query processor. For example, a remote query processor (e.g., 324) may be started to execute a query or view operation on data stored in the table associated with that remote query processor. The remote query processor 324 may be performing a task that is dynamic in nature in that the task may include computations that are updated periodically based on new data being received. When dynamically updating data is needed by a remote query processor, that remote query processor can register the need for dynamic (or updating) table data with the multicast subscriber process 320 on the query host machine 318. In some implementations, the multicast subscriber process 320 can follow steps shown in FIG. 5 and described below.

The log taller process 312 can provide data to a data import server 334 within a database publishing system 332. The data import server 334 can store the data in a storage 336 and can send the keys and, optionally, full data 338 to the remote query processors (e.g., 324 and/or 326). While TCP/IP is discussed herein as an example networking protocol, it will be appreciated that any suitable protocol could be used, e.g., Infiniband, RDMA, etc. Also, a system can include overlay, virtual, or software-defined networks, or cloud-based networks or systems, and the communication protocols use for publishing/subscribing as described herein could include protocols suitable for the type of network being utilized.

In some implementations, the remote query processors can read available keys through a normal table data protocol (via the TDCP, directly from the DIS, or local reads). Once the set of keys is known, the remote query processors can communicate with the multicast subscriber daemon to declare interest/subscribe to the desired set of instances. The full data is then sent by the publisher daemon to the subscriber daemon (either over unicast or multicast), and the subscribing daemon can write the data to shared memory. The remote query processors can then poll shared memory, and update in memory data object (e.g., table) representations.

FIG. 4 is a flowchart of an example method 400 for remote data table publishing using a multicast key-value protocol in accordance with at least one embodiment. Processing begins at 402 where an indication of new data available is received by a multicast publishing process. For example a multicast publishing process 306 could receive an indication of new data available via an application programming interface (API) call from the data source process 304. The indication (e.g., API call) may contain the updated data or may contain a reference to a storage location of the updated data. Processing continues to 404.

At 404, a sequence identifier (ID) is updated. The sequence identified can be used to help ensure that the most recent data is being processed by a subscriber. For example, in some implementations, the sequence ID may be required, each key-value pair can have a sequence number, which can be combined with a special message to help ensure that no data is dropped and to help prevent misordering. Processing continues to 406.

At 406, the new data is packaged into a publisher message (e.g., a broadcast message) including key-value data associated with the new data and a sequence ID. For example, the multicast publishing process 306 could package the newly received data into a broadcast message to be sent via broadcast network connection 316 to one or more subscribing processes (e.g., 320) in corresponding query machines (e.g., 318). Processing continues to 408.

At 408, the publisher message is broadcast to all subscribers via a key-value protocol. For example, the multicast publishing process 306 can send the broadcast message to subscriber processes (e.g., 320 in query machine 318) over the IP multicast connection 316. The multicast data can be divided into streams such that subscribers can receive a subset of the data for which they have interest. The divisions in the data can be arbitrary and many subscribers may receive more data than they need. Processing continues to 410.

At 410, the publishing process determines whether any retransmit requests have been received. For example, the multicast publishing process 306 could receive a retransmit request sent from a subscriber process 320 via the TCP retransmit channel 314. Retransmit requests can be for a single key-value pair or for all of the data from a given publisher. If no retransmit request has been received, processing continues to 412. If a retransmit request is received, processing continues to 414.

At 412, the publishing process idles waiting for an indication of new data (in which case processing could begin at 402 again, for example) or for a retransmit request in which case processing could continue to 414).

At 414, a response to the retransmit request message is sent. In an example implementation, the response may be sent either via TCP, UDP, or multicast. The publishing and subscribing daemons may make different data transmission decisions (e.g., sending the first retransmission via TCP; but a second one soon after via multicast), Processing continues to 412.

FIG. 5 is a flowchart of an example method 500 for remote data table subscribing using a multicast key-value protocol in accordance with at least one embodiment. Processing begins at 502, where a request for a group of keys sent from a remote query processor is received at a multicast subscriber process. For example, multicast subscriber process 320 could receive a request for updates to a group of keys from a remote query processor (e.g., 324 or 326). Processing continues to 504.

At 504, the multicast subscriber process can optionally request current key-value data for each key in the group of keys from a multicast publisher process. For example, a subscriber process (e.g., 320) can request current key-value data for the group of keys from the multicast publishing process 306. The requests are sent via TCP, but the data can come either way. Processing continues to 506.

At 506, current key-value data received from the multicast publishing process in response to the request from a multicast subscriber process is added to a key-value map maintained by the subscriber process. Processing continues to 508.

At 508, the multicast subscriber process receives a broadcast message containing key-value pair data from a multicast publishing process. For example, the multicast subscriber process 320 can receive a multicast broadcast message containing key-value pair data from the multicast publishing process 306 via the IP multicast channel 316. An example of a key-value pair would be a stock symbol (key) and a current bid/offer price and size (value). Another example of a key-value pair would be an account and security (key) and net position including various attributes such as profit and loss (PNL) or entry cost (values). Some implementations can include key-multivalue pairs, where the value supplies multiple values for the row of a table (possibly including the whole row). Processing continues to 510.

At 510, the multicast subscriber process can iterate through the key-value pairs in a received broadcast message and evaluate each key to determine if the key is in the key-value map maintained by the multicast subscriber process (512). If a given key is found in the key-value map, processing continues to 514. If the given key is not found in the key-value map, processing continues to 518.

At 514, the multicast subscriber process evaluates any received sequence IDs to determine the most recent value for the given key-value pair being processed. Processing continues to 516.

At 516, the multicast subscriber process updates the key-value map with the most recent data for the given key. Processing continues to 518.

At 518, the multicast subscriber process determines whether there are any key-value pairs from the received broadcast message remaining to be processed. The multicast subscriber process updates shared memory with key-value pair data that has been subscribed to, and may optionally dispatch notifications (keys for updated data) to its subscribers (e.g. the RQP). If there are remaining key-value pairs to process, processing continues to 520. If all key-value pairs from the broadcast message have been processed, processing continues to 522.

At 520, the next key-value pair to be processed is selected by the multicast subscriber process. Processing continued to 512.

At 522, the system determines if it is time to process changes through the DAG (e.g., based on a logical clock state transition, etc.). If it is time to process update notifications through the DAG, process continues to 524, otherwise processing returns to 522.

At 524, a subscriber process (e.g., an RQP) can poll the shared memory data or drain queued notifications on its own schedule in order to update the in-memory table and propagate changes via the UPG (see 526). Processing continues to 526.

At 526, the subscriber process propagates change messages (e.g., add, modify, or delete messages or other types of messages) to affected tables based on the DAG. Once the table data updates have been processed, the multicast subscriber process can return to idle awaiting a new request for a group of keys to update from a remote query processor (and continue to 502) or a new broadcast message (and continue to 506).

FIG. 6 is a diagram of an example computing device 600 in accordance with at least one implementation. The computing device 600 includes one or more processors 602, operating system 604, computer readable medium 606 and network interface 608. The memory 606 can include a data object publishing/subscribing application 610 including a multicast key-value protocol and a data section 612 (e.g., for storing publisher/subscriber information, etc.).

In operation, the processor 602 may execute the application 610 stored in the memory 606. The application 610 can include software instructions that, when executed by the processor, cause the processor to perform operations for data object publishing/subscribing in accordance with the present disclosure (e.g., performing one or more of 402-414 and/or 502-526 described above).

The application program 610 can operate in conjunction with the data section 612 and the operating system 604.

It will be appreciated that the modules, processes, systems, and sections described above can be implemented in hardware, hardware programmed by software, software instructions stored on a nontransitory computer readable medium or a combination of the above. A system as described above, for example, can include a processor configured to execute a sequence of programmed instructions stored on a nontransitory computer readable medium. For example, the processor can include, but not be limited to, a personal computer or workstation or other such computing system that includes a processor, microprocessor, microcontroller device, or is comprised of control logic including integrated circuits such as, for example, an Application Specific Integrated Circuit (ASIC), a field programmable gate array (FPGA), a graphics processing unit (e.g., GPGPU or GPU) or the like. The instructions can be compiled from source code instructions provided in accordance with a programming language such as Java, C, C++, C#.net, assembly or the like. The instructions can also comprise code and data objects provided in accordance with, for example, the Visual Base™ language, a specialized database query language, or another structured or object-oriented programming language. The sequence of programmed instructions, or programmable logic device configuration software, and data associated therewith can be stored in a nontransitory computer-readable medium such as a computer memory or storage device which may be any suitable memory apparatus, such as, but not limited to ROM, PROM, EEPROM, RAM, flash memory, disk drive and the like. The processor and/or computer readable medium can include photonics, spintronics, and/or quantum devices.

Furthermore, the modules, processes systems, and sections can be implemented as a single processor or as a distributed processor. Further, it should be appreciated that the steps mentioned above may be performed on a single or distributed processor (single and/or multi-core, or cloud computing system). Also, the processes, system components, modules, and sub-modules described in the various figures of and for embodiments above may be distributed across multiple computers or systems or may be co-located in a single processor or system. Example structural embodiment alternatives suitable for implementing the modules, sections, systems, means, or processes described herein are provided below.

The modules, processors or systems described above can be implemented as a programmed general purpose computer, an electronic device programmed with microcode, a hard-wired analog logic circuit, software stored on a computer-readable medium or signal, an optical computing device, a networked system of electronic and/or optical devices, a special purpose computing device, an integrated circuit device, a semiconductor chip, and/or a software module or object stored on a computer-readable medium or signal, for example.

Embodiments of the method and system (or their sub-components or modules), may be implemented on a general-purpose computer, a special-purpose computer, a programmed microprocessor or microcontroller and peripheral integrated circuit element, an ASIC or other integrated circuit, a digital signal processor, a hardwired electronic or logic circuit such as a discrete element circuit, a programmed logic circuit such as a PLD, PLA, FPGA, PAL, GP, GPU, or the like. In general, any processor capable of implementing the functions or steps described herein can be used to implement embodiments of the method, system, or a computer program product (software program stored on a nontransitory computer readable medium).

Furthermore, embodiments of the disclosed method, system, and computer program product (or software instructions stored on a nontransitory computer readable medium) may be readily implemented, fully or partially, in software using, for example, object or object-oriented software development environments that provide portable source code that can be used on a variety of computer platforms. Alternatively, embodiments of the disclosed method, system, and computer program product can be implemented partially or fully in hardware using, for example, standard logic circuits or a VLSI design. Other hardware or software can be used to implement embodiments depending on the speed and/or efficiency requirements of the systems, the particular function, and/or particular software or hardware system, microprocessor, or microcomputer being utilized. Embodiments of the method, system, and computer program product can be implemented in hardware and/or software using any known or later developed systems or structures, devices and/or software by those of ordinary skill in the applicable art from the function description provided herein and with a general basic knowledge of the software engineering and computer networking arts.

Moreover, embodiments of the disclosed method, system, and computer readable media (or computer program product) can be implemented in software executed on a programmed general purpose computer, a special purpose computer, a microprocessor, or the like.

It is, therefore, apparent that there is provided, in accordance with the various embodiments disclosed herein, methods, systems and computer readable media for data object publishing/subscribing including a multicast key-value protocol.

Application Ser. No. ______, entitled “DATA PARTITIONING AND ORDERING” (Attorney Docket No. W1.1-10057) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “COMPUTER DATA SYSTEM DATA SOURCE REFRESHING USING AN UPDATE PROPAGATION GRAPH” (Attorney Docket No. W1.4-10058) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “COMPUTER DATA SYSTEM POSITION-INDEX MAPPING” (Attorney Docket No. W1.5-10083) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “SYSTEM PERFORMANCE LOGGING OF COMPLEX REMOTE QUERY PROCESSOR QUERY OPERATIONS” (Attorney Docket No. W1.6-10074) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “DISTRIBUTED AND OPTIMIZED GARBAGE COLLECTION OF REMOTE AND EXPORTED TABLE HANDLE LINKS TO UPDATE PROPAGATION GRAPH NODES” (Attorney Docket No. W1.8-10085) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “COMPUTER DATA SYSTEM CURRENT ROW POSITION QUERY LANGUAGE CONSTRUCT AND ARRAY PROCESSING QUERY LANGUAGE CONSTRUCTS” (Attorney Docket No, W2.1-10060) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “PARSING AND COMPILING DATA SYSTEM QUERIES” (Attorney Docket No. W2.2-10062) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “DYNAMIC FILTER PROCESSING” (Attorney Docket No. W2.4-10075) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “DYNAMIC JOIN PROCESSING USING REAL-TIME MERGED NOTIFICATION LISTENER” (Attorney Docket No. W2.6-10076) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “DYNAMIC TABLE INDEX MAPPING” (Attorney Docket No. W2.7-10077) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “QUERY TASK PROCESSING BASED ON MEMORY ALLOCATION AND PERFORMANCE CRITERIA” (Attorney Docket No. W2.8-10094) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “A MEMORY-EFFICIENT COMPUTER SYSTEM FOR DYNAMIC UPDATING OF JOIN PROCESSING” (Attorney Docket No. W2.9-10107) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “QUERY DISPATCH AND EXECUTION ARCHITECTURE” (Attorney Docket No, W31-10061) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “COMPUTER DATA DISTRIBUTION ARCHITECTURE” (Attorney Docket No, W12-10087) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “DYNAMIC UPDATING OF QUERY RESULT DISPLAYS” (Attorney Docket No. W3.3-10059) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “DYNAMIC CODE LOADING” (Attorney Docket No. W3.4-10065) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “IMPORTATION, PRESENTATION, AND PERSISTENT STORAGE OF DATA” (Attorney Docket No. W3.5-10088) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “COMPUTER DATA DISTRIBUTION ARCHITECTURE” (Attorney Docket No. W3.7-10079) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “PERSISTENT QUERY DISPATCH AND EXECUTION ARCHITECTURE” (Attorney Docket No. W4.2-10089) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “SINGLE INPUT GRAPHICAL USER INTERFACE CONTROL ELEMENT AND METHOD” (Attorney Docket No. W4.3-10063) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “GRAPHICAL USER INTERFACE DISPLAY EFFECTS FOR A COMPUTER DISPLAY SCREEN” (Attorney Docket No, W4.4-10090) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “COMPUTER ASSISTED COMPLETION OF HYPERLINK COMMAND SEGMENTS” (Attorney Docket No. W4.5-10091) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “HISTORICAL DATA REPLAY UTILIZING A COMPUTER SYSTEM” (Attorney Docket No. W5.1-10080) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “DATA STORE ACCESS PERMISSION SYSTEM WITH INTERLEAVED APPLICATION OF DEFERRED ACCESS CONTROL FILTERS” (Attorney Docket No. W6.1-10081) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. ______, entitled “REMOTE DATA OBJECT PUBLISHING/SUBSCRIBING SYSTEM HAVING A MULTICAST KEY-VALUE PROTOCOL” (Attorney Docket No. W7.2-10064) and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

While the disclosed subject matter has been described in conjunction with a number of embodiments, it is evident that many alternatives, modifications and variations would be, or are, apparent to those of ordinary skill in the applicable arts. Accordingly, Applicants intend to embrace all such alternatives, modifications, equivalents and variations that are within the spirit and scope of the disclosed subject matter. 

What is claimed is:
 1. A system comprising: a data source computing device including a first nontransitory memory containing instructions for a publishing process using a key-value protocol; a first electronic communications channel including a first communications protocol; a second electronic communications channel including a second communications protocol; and a query computing device coupled to the data source computing device via the first electronic communications channel and the second electronic communications channel, the query computing device including a second nontransitory memory containing instructions for a subscriber process using the key-value protocol, wherein the instructions for a publishing process stored in the first nontransitory memory include instructions that, when executed by the data source computing device, cause the data source computing device to perform operations including: receiving, at the data source computing device, an indication of new data available; updating, at the data source computing device, a sequence identifier value; packaging, at the data source computing device, at least a portion of the new data into a publisher message including a key-value pair and the updated sequence identifier value; and broadcasting, from the data source computing device, the publisher message via the first electronic communication channel, wherein the instructions for a subscriber process stored in the second nontransitory memory include instructions that, when executed by the query computing device, cause the query computing device to perform operations including: receiving, at the query computing device, a request for a group of keys from a remote query processor; transmitting, from the query computing device via the second electronic communications channel, a request for current key-value data from the data source computing device; receiving a request from a remote query processor to subscribe to a group of keys; adding, at the query computing device, the current values to a key-value map; receiving, at the query computing device, a key-value protocol broadcast message; for each key in the received keys that are in the key-value map, evaluating, at the query computing device, a sequence identifier (ID) to determine most recent data and updating the value for that key in the key-value map with the most recent data; generating an updated object based on the received key-value data; and propagating changes based on the updated data object to any dependent objects according to an update propagation graph of data object dependencies.
 2. The system of claim 1, wherein the first communications protocol includes an Internet protocol (IP) multicast protocol.
 3. The system of claim 1, wherein the second communications protocol includes transmission control protocol (TCP).
 4. The system of claim 1, wherein the data source computing device further includes: a data source process coupled to the multicast publishing process; one or more key log files generated by the data source process; and a log tailer process configured to access the one or more key log files.
 5. The system of claim 4, wherein the data source computing device further includes: one or more data log files, wherein the log tailer process is configured to access the one or more data log files.
 6. The system of claim 1, wherein the query computing device further includes: one or more remote query processors; and a shared memory accessible by the multicast subscriber process and at least one of the one or more remote query processors.
 7. A method for publishing comprising: receiving, at a data source computing device, an indication of new data available; updating, at the data source computing device, a sequence identifier value; packaging, at the data source computing device, at least a portion of the new data into a publisher message including a key-value pair and the updated sequence identifier value; and broadcasting, from the data source computing device, the publisher message via a first electronic communication channel in a first communication protocol.
 8. The method of claim 7, wherein the first communication protocol includes an Internet protocol (IP) multicast protocol.
 9. The method of claim 7, wherein the data source computing device includes: a data source process coupled to the publishing process; one or more key log files generated by the data source process; and a log tailer process configured to access the one or more key log files.
 10. The method of claim 9, wherein the data source computing device further includes: one or more data log files, wherein the log tailer process is configured to access the one or more data log files.
 11. A method for subscription comprising: receiving, at a query computing device, a request for a group of keys from a remote query processor; transmitting, from the query computing device via a second electronic communications channel in a first communication protocol, a request for current key-value data to a data source computing device; receiving a request from a remote query processor to subscribe to a group of keys; adding, at the query computing device, the current values to a key-value map; receiving, at the query computing device, a key-value protocol broadcast message; for each key in the received keys that are in the key-value map, evaluating, at the query computing device, a sequence identifier (ID) to determine most recent data and updating the value for that key in the key-value map with the most recent data; generating an updated object based on the received key-value data; and propagating changes based on the updated data object to any dependent objects according to an update propagation graph of data object dependencies.
 12. The method of claim 11, wherein the first communication protocol includes transmission control protocol (TCP).
 13. The method of claim 11, wherein the query computing device further includes: one or more remote query processors; and a shared memory accessible by the subscriber process and at least one of the one or more remote query processors. 